منابع مشابه
An Extremal Problem for Complete Bipartite Graphs
Define f(n, k) to be the largest integer q such that for every graph G of order n and size q, G contains every complete bipartite graph K u, ,, with a+h=n-k . We obtain (i) exact values for f(n, 0) and f(n, 1), (ii) upper and lower bounds for f(n, k) when ku2 is fixed and n is large, and (iii) an upper bound for f(n, lenl) .
متن کاملExtremal graphs for the identifying code problem
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from other vertices by the set of vertices in C that are at distance at most 1 from x. The problem of finding an identifying code of minimum possible size turned out to be a challenging problem. It was proved by N. Bertrand, I. Charon, O. Hudry and A. Lobstein that if a graph on n vertices with...
متن کاملAn extremal problem for H-linked graphs
We introduce the notion of H-linked graphs, where H is a fixed multigraph with vertices w1; . . . ;wm. A graph G is H-linked if for every choice of vertices v1; . . . ; vm in G, there exists a subdivision of H in G such that vi is the branch vertex representing wi (for all i). This generalizes the notions of k -linked, k -connected, and k-ordered graphs. Given k and n 5k þ 6, we determine the l...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1987
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90139-7